Efficient composition and automatic initialization of arbitrary structured PVM programs
نویسنده
چکیده
There are significant programming and methodological problems when developing PVM programs, the process communication structure of which does not form trees but arbitrary graphs. We present a design methodology, called Ensemble, and the appropriate PVM techniques and tools for the efficient composition of arbitrarily structured PVM programs. In Ensemble PVM programs are described by annotated Process Communication Graphs (PCGs) and the sequential program components are designed with open communication interfaces. The annotated PCGs are interpreted by a universal PVM program Loader which spawns processes and sets values to their communication interfaces, thus establishing the program communication structure. The program components are reusable without any modification in other PVM programs. Annotated PCGs are produced from PVM program scripts. The methodology may be applied to any message passing environment by developing specific annotations of the PCG, reusable program components and the program loader.
منابع مشابه
Automatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملEfficient Composition of PVM Programs
J.Y. Cotronis, E. Floros, N. Papazis Dept. of Informatics, Univ. of Athens, Panepistimiopolis, 157 71 Athens, GREECE. tel.: +30 1 7230172 fax: +30 1 7219 561 e-mail: [cotronis, floros, papazis]@di.uoa.gr Overview Programs forming tree process communication topologies, each process communicating only with its parent and children processes, are well suited to PVM [2], whilst programs forming grap...
متن کاملSimulating Parallel Program Performance with CLUE
In this paper the simulation and assessment tool CLUE is described. This tool is able to simulate the performance of parallel programs using the message passing library PVM for communication, run on arbitrary parallel m achines, including PC clusters. CLUE redirects calls to PVM to its own functions, providing an additional layer between an application and PVM. The simulation is driven by the a...
متن کاملCompiling machine learning programs via high-level tracing
We describe JAX, a domain-specific tracing JIT compiler for generating high-performance accelerator code from pure Python and Numpy machine learning programs. JAX uses the XLA compiler infrastructure to generate optimized code for the program subroutines that are most favorable for acceleration, and these optimized subroutines can be called and orchestrated by arbitrary Python. Because the syst...
متن کامل